Computing the Visibility Graph of Points Within a
نویسندگان
چکیده
The subject of this thesis is the problem of computing the visibility graph of m points P within a polygon Q. The vertices of the visibility graph are the points of P and the edges of the graph are the pairs of points in P×P , where the line between them is fully contained inside Q. Known algorithms by Ben-Moshe et al. are presented for computing the visibility graph of a simple polygon, the visibility graph of a polygon with holes, the range-restricted visibility graph and the invisibility graph. Finally, a new improved algorithm to compute the invisibility graph is presented. This algorithm improves the running time by a factor O(m) of the, so far, best algorithm.
منابع مشابه
Epileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملUnsolved Problems in Visibility Graph Theory
The visibility graph is a fundamental structure studied in the field of computational geometry, and pose some special challenges [12, 26]. Apart from theoretical interests, visibility graphs has important applications also. Some of the early applications include computing Euclidean shortest paths in the presence of obstacles [36] and decomposing two-dimensional shapes into clusters [40]. For mo...
متن کاملA Two-Pass Physics-Based Global Lighting Model
This paper describes a two-pass implementation of a physics-based global lighting model. This latter uses a physics-based reflection model, spectral distribution of light powers, and does not make any assumption on the specular behavior of materials. The scenes are discretized into points instead of patches . Hence, any kind of surface can be used without having to break down it into small plan...
متن کاملCOMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کامل